Useful Inequalities for the Longest Run Distribution
نویسنده
چکیده
General inequalities for the distribution of the longest success run in Bernoulli trials are found through a direct combinatorial analysis. Their employment allows the derivation of a new lower bound which can be used in the achievement of theoretical results.
منابع مشابه
On Runs in Independent Sequences
Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.
متن کاملOn the Distribution of the Longest Run in Number Partitions
We consider the distribution of the longest run of equal elements in number partitions (equivalently, the distribution of the largest gap between subsequent elements); in a recent paper, Mutafchiev proved that the distribution of this random variable (appropriately rescaled) converges weakly. The corresponding distribution function is closely related to the generating function for number partit...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملDistribution of the Length of the Longest Significance Run on a Bernoulli Net and Its Applications
We consider the length of the longest significance run in a (two-dimensional) Bernoulli net and derive its asymptotic limit distribution. Our results can be considered as generalizations of known theorems in significance runs. We give three types of theoretical results: (1) reliabilitystyle lower and upper bounds, (2) Erdös–Rényi law, and (3) the asymptotic limit distribution. To understand the...
متن کاملAn Erdos - Rhyi taw with Shifts RICHARD
Motivated by the comparison of DNA sequences, a generalization is given of the result of Erdos and Renyi on the length R, of the longest run of heads in the first n tosses of a coin. Suppose that all the " letters " are independent and identically distributed. The length of the longest match without shifts has the same distribution as R, , the length of the longest head run for a biased coin wi...
متن کامل